Genetically Evolved Solution to Timetable Scheduling Problem
نویسندگان
چکیده
منابع مشابه
AFSCN scheduling: How the problem and solution have evolved
The Air Force Satellite Control Network (AFSCN) coordinates communications to more than 100 satellites via nine ground stations positioned around the globe. Customers request an antenna at a ground station for a specific time window along with possible alternative slots. Typically, 500 requests per day result in more than 100 conflicts, which are requests that cannot be satisfied because other ...
متن کاملSolving Timetable Scheduling Problem by Using Genetic Algorithms
In this paper a genetic algorithm for solving timetable scheduling problem is described. The algorithm was tested on small and large instances of the problem. Algorithm performance was significantly enhanced with modification of basic genetic operators, which restrain the creation of new conflicts in the
متن کاملAn Adaptive Problem-Solving Solution to Large-Scale Scheduling Problems
Although the general class of most scheduling problems is NP-hard in worst-case complexity, in practice, domain-specific techniques frequently solve problems in much better than exponential time. Unfortunately, constructing special-purpose systems is a knowledge–intensive and time-consuming process that requires a deep understanding of the domain and problem-solving architecture. The goal of ou...
متن کاملSecuring Network Traffic Using Genetically Evolved Transformations
The paper describes a new approach of classification using genetic programming. The proposed technique consists of genetically coevolving a population of non-linear transformations on the input data to be classified, and map them to a new space with a reduced dimension, in order to get maximum inter-classes discrimination. The classification of new samples is then performed on the transformed d...
متن کاملA Genetic Algorithm to Solve the Timetable Problem
The paper presents an application of an adapted genetic algorithm to a real world instance of the timetable problem. The results of its application are described. We also compare our results with simulated annealing and tabu search. Abstract In this paper we present the results of an investigation of the possibilities offered by genetic algorithms to solve the timetable problem. This problem ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2015
ISSN: 0975-8887
DOI: 10.5120/20077-2100